Concurrent execution of a computer software application along multiple decision paths

ABSTRACT

Managing the execution of a computer software application by duplicating a primary instance of a computer software application during its execution in a primary execution context to create multiple duplicate instances of the computer software application in corresponding duplicate execution contexts, and effecting a selection of a different candidate subset of predefined elements for each of the duplicate instances.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of U.S. application Ser. No.13/537,764, filed on Jun. 29, 2012, the entirety of which isincorporated herein by reference.

FIELD OF THE INVENTION

The present invention relates to managing the execution of a computersoftware application in general.

BACKGROUND OF THE INVENTION

During the execution of a computer software application a point may bereached where the application presents a set of options, such as where acomputer user is meant to select one of the options, whereupon executionof the application is meant to continue along one of several pathsdepending on which option is selected. Often, when an applicationpresents such options to a computer user for selection, the user mightnot know what selection to make, thus delaying execution of theapplication until a selection is made. Such execution delays are oftencostly, and therefore undesirable.

SUMMARY OF THE INVENTION

In one aspect of the invention a method is provided for managing theexecution of a computer software application, the method includingduplicating a primary instance of a computer software application duringits execution in a primary execution context, thereby creating multipleduplicate instances of the computer software application incorresponding duplicate execution contexts, and effecting a selection ofa different candidate subset of predefined elements for each of theduplicate instances.

In other aspects of the invention systems and computer program productsembodying the invention are provided.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be understood and appreciated more fully from thefollowing detailed description taken in conjunction with the appendeddrawings in which:

FIG. 1 is a simplified conceptual illustration of a system forconcurrent execution of a computer software application along multipledecision paths, constructed and operative in accordance with anembodiment of the invention;

FIGS. 2A-2D are simplified conceptual illustrations of various aspectsof the operation of the system of FIG. 1 with respect to an exemplaryscenario, operative in accordance with an embodiment of the invention;

FIG. 3 is a simplified flowchart illustration of an exemplary method ofoperation of the system of FIG. 1, operative in accordance with anembodiment of the invention;

FIG. 4 is a simplified flowchart illustration of an exemplary method ofoperation of the system of FIG. 1, operative in accordance with anembodiment of the invention;

FIG. 5 is a simplified flowchart illustration of an exemplary method ofoperation of the system of FIG. 1, operative in accordance with anembodiment of the invention; and

FIG. 6 is a simplified block diagram illustration of an exemplaryhardware implementation of a computing system, constructed and operativein accordance with an embodiment of the invention.

DETAILED DESCRIPTION OF THE INVENTION

The invention is now described within the context of one or moreembodiments, although the description is intended to be illustrative ofthe invention as a whole, and is not to be construed as limiting theinvention to the embodiments shown. It is appreciated that variousmodifications may occur to those skilled in the art that, while notspecifically shown herein, are nevertheless within the true spirit andscope of the invention.

As will be appreciated by one skilled in the art, aspects of the presentinvention may be embodied as a system, method or computer programproduct. Accordingly, aspects of the present invention may take the formof an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present invention may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical datastorage device, a magnetic data storage device, or any suitablecombination of the foregoing. In the context of this document, acomputer readable storage medium may be any tangible medium that cancontain, or store a program for use by or in connection with aninstruction execution system, apparatus, or device.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of thepresent invention may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java, Smalltalk, C++ or the like and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present invention are described below with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

Reference is now made to FIG. 1, which is a simplified conceptualillustration of a system for concurrent execution of a computer softwareapplication along multiple decision paths, constructed and operative inaccordance with an embodiment of the invention. In the system of FIG. 1,an execution manager 100 is configured to duplicate a primary instance102 of a computer software application during its execution in a primaryexecution context on a computer 104, thereby creating any number ofduplicate instances 106 of the computer software application, where theduplicate instances 106 are preferably executed in parallel in acorresponding number of duplicate execution contexts on computer 104 orone or more other computers (not shown).

A selection point detector 108 is configured to detect when primaryinstance 102 requests that primary instance 102 be duplicated, such aswhen primary instance 102 reaches a point during its execution where itpresents a set 110 of predefined elements, such as buttons representingvarious options, where a computer user is meant to select one of theoptions, whereupon execution of primary instance 102 is meant tocontinue along one of several paths depending on which option isselected. Execution manager 100 is preferably configured to duplicateprimary instance 102 in response to selection point detector 108detecting the request by primary instance 102. Additionally oralternatively, selection point detector 108 is configured to detect whenprimary instance 102 otherwise provides an indication that a selectionbe made of any of the predefined elements in set 110, where executionmanager 100 is configured to duplicate primary instance 102 in responseto selection point detector 108 detecting the indication.

A selector 112 is configured to effect a selection of a differentcandidate subset of the predefined elements in set 110 for each of theduplicate instances 106. Continuing with the previous example whereprimary instance 102 presents various options for selection, selector112 preferably selects a different option for each of the duplicateinstances 106, such that each of the duplicate instances 106 continuesits execution based on the selection of a different one of the options.

A selection detector 114 is configured to detect when a selection of aprimary subset of set 110 of the predefined elements is made for primaryinstance 102. Execution manager 100 is preferably configured todetermine, in response to the primary subset selection being made,whether any of the duplicate instances 106 is currently being executedwhose candidate subset is identical to the primary subset. Executionmanager 100 is preferably configured to terminate primary instance 102and any, and preferably all, of the duplicate instances 106 whosecandidate subset of the predefined elements in set 110 differs from theprimary subset. Preferably, only one of the duplicate instances 106 ismaintained in an execution context, one whose candidate subset of thepredefined elements in set 110 is identical to the primary subsetselected for primary instance 102. Execution manager 100 preferablyprovides a notification if no such duplicate instance 106 is found,and/or terminates any, and preferably all, of the duplicate instances106.

Additionally or alternatively, selection detector 114 is configured todetect when a selection is made of any of the instances of the computersoftware application, including duplicate instances 106 and optionallyincluding primary instance 102 as well, where execution manager 100 isconfigured to terminate any, and preferably all, of the instancesexcluded from the selection.

Additionally or alternatively, primary instance 102 and/or any of theduplicate instances 106 may be configured to self-terminate if theinstance determines that any other of the instances meets a predefinedcondition. For example, if one of the duplicate instances 106successfully completes a particular task, and primary instance 102 andthe other duplicate instances 106 are able to determine this using anyconventional technique, such as where the successful duplicate instance106 is able to directly or indirectly notify the other instances using apublication/subscription system, the other instances may self-terminate,leaving only the successful instance to continue its execution.

It is appreciated that any duplicate instance may itself be duplicatedas described herein in the same manner as primary instance 102 isduplicated, such as when it, too, reaches a point during its executionwhere it presents a set of predefined elements for selection. Thus, aprimary instance may spawn duplicate instances which in turn spawnduplicate instances and so on, preferably to a user-defined limit, suchas to a predefined generation depth or maximum number of instances. Eachduplicate instance of any generation may be managed with respect to its“parent” instance as primary instance 102 and its duplicate instances106 are managed as described herein.

Any of the elements shown in FIG. 1 are preferably implemented by one ormore computers, such as computer 104, in computer hardware and/or incomputer software embodied in a non-transitory, computer-readable mediumin accordance with conventional techniques.

Reference is now made to FIGS. 2A-2D, which illustrate, in the contextof an exemplary scenario, various aspects of the operation of the systemof FIG. 1, operative in accordance with embodiments of the invention.FIG. 2A shows a dialog 200 of a primary instance of an installationprogram during its execution, where at a certain point during itsexecution the installation program asks a user to select one of twooptions 202 and 204. In the example shown, the installation program isexecuted inside a virtual machine (VM) that is managed by a hypervisor,which is itself managed by an execution manager that is referred toherein as a Cloud Management System (CMS). Upon presenting the optionsto the user the installation program within the VM, now referred to asthe Base-VM, provides the options to the CMS and asks the CMS toduplicate or “fork” the Base-VM by cloning the Base-VM, including thecurrently-executed installation program and the Base-VM internal stateinformation, into a different clone VM, now referred to as Clone-01 andClone-02, for each one of the options. FIG. 2B shows the CMS, theBase-VM, Clone-01, and Clone-02 immediately after the forking iscompleted, where the states of Clone-01 and Clone-02 are identical tothe state of Base-VM. Clone-01 and Clone-02 then ask the CMS to provideselected options for execution. Thus, in the example shown, the CMSselects and returns one option to Clone-01 and selects and returns theother option to Clone-02 as is shown in FIG. 2C. The installationprogram in Clone-01 then continues its execution using the optionselected for it, while the installation program in Clone-02 continuesits execution using the option selected for it.

FIG. 2D shows the installation programs within the VMs providing statusnotifications relating to their execution progress. Thus, when Clone-01reports its installation progress as being 50% complete, the Base-VM mayuse this information to notify a user regarding the progress of theinstallation. When Clone-02 reports that its installation attempt endedin failure (i.e., it is configured to make this determination) andClone-01 reports that its installation attempt ended in success, theBase-VM may use this information to notify a user that the selection ofoption #1 is recommended, and/or the CMS may automatically terminateClone-02 as well as Base-VM itself, whereupon the user may continue towork only with Clone-01. In this manner, execution of the installationprogram may continue even if a user never selects either of options 202and 204 (FIG. 2A). However, should a user select an option at any timeduring the execution of the installation program in the clone VMs, and aclone VM exists that corresponds to the selected option, the CMS mayterminate the Base-VM and all other clone VMs, whereupon the user maycontinue to work only with the clone VM that corresponds to the selectedoption.

Reference is now made to FIG. 3, which is a simplified flowchartillustration of an exemplary method of operation of the system of FIG.1, operative in accordance with an embodiment of the invention. In themethod of FIG. 3, duplicate instances are made of a primary instance ofa computer software application during its execution (step 300), such aswhen the primary instance reaches a point during its execution where itpresents a set of predefined elements for selection, whereupon executionof the primary instance is meant to continue along one of several pathsdepending on which of the predefined elements is selected. A selectionof a different candidate subset of the predefined elements is effectedfor each of the duplicate instances (step 302), such that each of theduplicate instances continues its execution based on the candidatesubset selected for it. If a selection of a primary subset of thepredefined elements is made for the primary instance (step 304), and aduplicate instance exists whose candidate subset is identical to theprimary subset (step 306), then the primary instance and any, andpreferably all, of the duplicate instances whose candidate subsetdiffers from the primary subset are terminated (step 308). If noduplicate instance exists whose candidate subset is identical to theprimary subset, any, and preferably all, of the duplicate instances areterminated and processing of the primary instance continues (step 310).

Reference is now made to FIG. 4, which is a simplified flowchartillustration of an exemplary method of operation of the system of FIG.1, operative in accordance with an embodiment of the invention. In themethod of FIG. 4, duplicate instances are made of a primary instance ofa computer software application during its execution (step 400), such aswhen the primary instance reaches a point during its execution where itpresents a set of predefined elements for selection, whereupon executionof the primary instance is meant to continue along one of several pathsdepending on which of the predefined elements is selected. A selectionof a different candidate subset of the predefined elements is effectedfor each of the duplicate instances (step 402), such that each of theduplicate instances continues its execution based on the candidatesubset selected for it. If a selection is made of any of the instances(step 404), then any, and preferably all, of the non-selected instancesare terminated (step 406).

Reference is now made to FIG. 5, which is a simplified flowchartillustration of an exemplary method of operation of the system of FIG.1, operative in accordance with an embodiment of the invention. In themethod of FIG. 5, duplicate instances are made of a primary instance ofa computer software application during its execution (step 500), such aswhen the primary instance reaches a point during its execution where itpresents a set of predefined elements for selection, whereupon executionof the primary instance is meant to continue along one of several pathsdepending on which of the predefined elements is selected. A selectionof a different candidate subset of the predefined elements is effectedfor each of the duplicate instances (step 502), such that each of theduplicate instances continues its execution based on the candidatesubset selected for it. If any given instance determines that any otherof the instances meets a predefined condition that warrants thetermination of the given instance (step 504), the given instance mayself-terminate (step 506). Additionally or alternatively, if any giveninstance determines that it meets a predefined condition that warrantsthe termination of the other instances, such as when the given instancesuccessfully reaches a specified point in its execution, the giveninstance may instruct or otherwise cause the other instances toself-terminate or be terminated, or may provide a notification that thepredefined condition is met, whereupon the user may continue to workonly with the successful instance.

Referring now to FIG. 6, block diagram 600 illustrates an exemplaryhardware implementation of a computing system in accordance with whichone or more components/methodologies of the invention (e.g.,components/methodologies described in the context of FIGS. 1-5) may beimplemented, according to an embodiment of the invention.

As shown, the techniques for controlling access to at least one resourcemay be implemented in accordance with a processor 610, a memory 612, I/Odevices 614, and a network interface 616, coupled via a computer bus 618or alternate connection arrangement.

It is to be appreciated that the term “processor” as used herein isintended to include any processing device, such as, for example, onethat includes a CPU (central processing unit) and/or other processingcircuitry. It is also to be understood that the term “processor” mayrefer to more than one processing device and that various elementsassociated with a processing device may be shared by other processingdevices.

The term “memory” as used herein is intended to include memoryassociated with a processor or CPU, such as, for example, RAM, ROM, afixed memory device (e.g., hard drive), a removable memory device (e.g.,diskette), flash memory, etc. Such memory may be considered a computerreadable storage medium.

In addition, the phrase “input/output devices” or “I/O devices” as usedherein is intended to include, for example, one or more input devices(e.g., keyboard, mouse, scanner, etc.) for entering data to theprocessing unit, and/or one or more output devices (e.g., speaker,display, printer, etc.) for presenting results associated with theprocessing unit.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

It will be appreciated that any of the elements described hereinabovemay be implemented as a computer program product embodied in acomputer-readable medium, such as in the form of computer programinstructions stored on magnetic or optical storage media or embeddedwithin computer hardware, and may be executed by or otherwise accessibleto a computer (not shown).

While the methods and apparatus herein may or may not have beendescribed with reference to specific computer hardware or software, itis appreciated that the methods and apparatus described herein may bereadily implemented in computer hardware or software using conventionaltechniques.

While the invention has been described with reference to one or morespecific embodiments, the description is intended to be illustrative ofthe invention as a whole and is not to be construed as limiting theinvention to the embodiments shown. It is appreciated that variousmodifications may occur to those skilled in the art that, while notspecifically shown herein, are nevertheless within the true spirit andscope of the invention.

What is claimed is:
 1. A method for managing execution of a computersoftware application, comprising: identifying, during execution of aprimary instance of the computer software application, the primaryinstance reaching an execution point that presents a plurality ofpredefined options to a user; wherein the computer software applicationis an installation program executing within a virtual machine, and eachof the plurality of duplicate instances execute within respective clonedvirtual machines; generating, prior to selection by the user of one ofthe pre-defined options and based upon the execution point beingreached, a plurality of duplicate instances of the primary instance;assigning, respectively, execution paths corresponding to the pluralityof predefined options to each of the plurality of duplicate instances;executing, prior to the selection by the user of one of the predefinedoptions, the plurality of duplicate instances along their respectiveexecution paths; gathering information associated with the execution ofthe each of the plurality of duplicate instances; automaticallyeliminating, as a predefined option to be presented to the user, thepredefined option corresponding to one of the plurality of duplicateinstances that resulted in a failed operation; presenting arecommendation, prior to the one predefined option being selected andbased upon gathering information, as to the plurality of predefinedoptions; determining that one of the plurality of pre-defined optionshas been selected; terminating, based upon the one predefined optionbeing selected, each of the duplicate instances not associated with theone predefined option; and identifying, within one of the executionpaths corresponding to the plurality of predefined options, a secondexecution point that presents a second plurality of predefined option tothe user, and repeating the steps of generating, assigning, andexecuting for the second execution path.
 2. The method of claim 1,wherein the recommendation regards an installation option.
 3. The methodof claim 1, wherein the primary instance is terminated upon each of theduplicate instances not associated with the one predefined option beingterminated.
 4. The method of claim 1, wherein each of the duplicateinstances not associated with the one predefined option are configuredto self-terminate based upon the one predefined option being selected.5. The method of claim 1, wherein the duplicate instance associated withthe one predefined option being selected is configured to terminate eachof the duplicate instances not associated with the one predefinedoption.